منابع مشابه
Enumerating k-Way Trees
This paper makes a contribution to the enumeration of trees. We prove a new result about k-way trees, point out some special cases, use it to give a new proof of Cayley’s enumeration formula for labelled trees, and observe that our techniques allow various types of k-way trees to be generated uniformly at random. We recall the definition: a k-way tree is either empty or it consists of a root no...
متن کاملEnumerating Alternating Trees
In this paper we examine the enumeration of alternating trees. We give a bijective proof of the fact that the number of alternating unrooted trees with n vertices is given by 1 n2 n?1 P n k=1 ? n k k n?1 , a problem rst posed by Postnikov in 4]. We also prove, using formal arguments, that the number of alternating plane trees with n vertices is 2(n ? 1) n?1 .
متن کاملEnumerating Distinct Decision Trees
The search space for the feature selection problem in decision tree learning is the lattice of subsets of the available features. We provide an exact enumeration procedure of the subsets that lead to all and only the distinct decision trees. The procedure can be adopted to prune the search space of complete and heuristics search methods in wrapper models for feature selection. Based on this, we...
متن کاملInversion of Integral Series Enumerating Planar Trees
We consider an integral series f(X, t) which depends on the choice of a set X of labelled planar rooted trees. We prove that its inverse with respect to composition is of the form f(Z, t) for another set Z of trees, deduced from X. The proof is self-contained, though inspired by the Koszul duality theory of quadratic operads. In the same vein we give a conceptual proof for the formulas giving t...
متن کاملEnumerating Constrained Non-crossing Geometric Spanning Trees
In this paper we present an algorithm for enumerating without repetitions all non-crossing geometric spanning trees on a given set of n points in the plane under edge constraints (i.e., some edges are required to be included in spanning trees). We will first prove that a set of all edge-constrained non-crossing spanning trees is connected via remove-add flips, based on the constrained smallest ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1971
ISSN: 0012-365X
DOI: 10.1016/0012-365x(71)90023-9